Equivalence of Measures of Complexity Classes

نویسندگان

  • Josef M. Breutzmann
  • Jack H. Lutz
چکیده

The resource-bounded measures of complexity classes are shown to be robust with respect to certain changes in the underlying probability measure. Speci cally, for any real number > 0, any uniformly polynomial-time computable sequence ~ = ( 0; 1; 2; : : : ) of real numbers (biases) i 2 [ ; 1 ], and any complexity class C (such as P, NP, BPP, P/Poly, PH, PSPACE, etc.) that is closed under positive, polynomial-time, truth-table reductions with queries of at most linear length, it is shown that the following two conditions are equivalent. (1) C has p-measure 0 (respectively, measure 0 in E, measure 0 in E2) relative to the coin-toss probability measure given by the sequence ~ . (2) C has p-measure 0 (respectively, measure 0 in E, measure 0 in E2) relative to the uniform probability measure. The proof introduces three techniques that may be useful in other contexts, namely, (i) the transformation of an e cient martingale for one probability measure into an e cient martingale for a \nearby" probability measure; (ii) the construction of a positive bias reduction, a truth-table reduction that encodes a positive, e cient, approximate simulation of one bias sequence by another; and (iii) the use of such a reduction to dilate an e cient martingale for the simulated probability measure into an e cient martingale for the simulating probability measure. This research was supported in part by National Science Foundation Grant CCR9157382, with matching funds from Rockwell, Microware Systems Corporation, and Amoco Foundation. E-mail: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The graph of equivalence classes and Isoclinism of groups

‎Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$‎. ‎In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$‎, ‎where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$‎. ‎We introduce a new graph determined ...

متن کامل

FUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS

In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...

متن کامل

Dynamic equivalence relation on the fuzzy measure algebras

The main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. In this paper, the notion of  dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. Also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...

متن کامل

The Quantitative Criteria Based on the Fractal Dimensions, Entropy, and Lacunarity for the Spatial Distribution of Cancer Cell Nuclei Enable Identification of Low or High Aggressive Prostate Carcinomas

BACKGROUND Tumor grading, PSA concentration, and stage determine a risk of prostate cancer patients with accuracy of about 70%. An approach based on the fractal geometrical model was proposed to eliminate subjectivity from the evaluation of tumor aggressiveness and to improve the prediction. This study was undertaken to validate classes of equivalence for the spatial distribution of cancer cell...

متن کامل

MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams

Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets: finding canonical representatives of equivalence classes of proofs that have good computational properties. It can also be seen as the word p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 1997